Coordination-Based Solver Cooperation in DICE
نویسنده
چکیده
DICE (DIstributed Constraint Environment) is a software framework, implemented in the Manifold coordination language, for constructing distributed constraint solvers. Currently it supports the cooperation of solvers that can act as a domain reduction operator inside a constraint propagation algorithm. In this paper we propose a number of extensions to the framework, that will provide support for a larger variety of solver cooperation schemes. The paper gives a high-level informal description of the current framework and the extensions, and shows how the target system can be used to implement a number of existing solver
منابع مشابه
OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine
Coordination programming deals with building complex software systems from largely autonomous component systems. Cooperative constraint solving (see for example [1]), which is widely recognized as a means to improve efficiency of constraint solving, is an area that may benefit from techniques developed in coordination programming, because the solvers that we want to combine are generally autono...
متن کاملA Coordination-Based Framework for Distributed Constraint Solving
This paper gives an overview of DICE (DIstributed Constraint Environment), a framework for the construction of distributed constraint solvers from software components in four categories: (1) variable domain types, (2) (incomplete) solvers, (3) splitting strategies, to build search trees, and (4) search strategies, to traverse these search trees. DICE is implemented using the Manifold coordinati...
متن کاملSoftware ENgineering A coordination-based framework for distributed constraint solving
DICE (DIstributed Constraint Environment) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. The framework is implemented using the Manifold coordination language, and coordinates the components of a distributed solver by means of coordination protocols that implement a distributed constraint propagation algorithm...
متن کاملStrategies for the Efficient Solution of Hybrid Constraint Logic Programs
Meta-S is a system for defining the cooperation and coordination of constraint solvers to attack hybrid constraint problems. The integration of a logic programming language into this system by considering the language evaluation mechanism resolution as constraint solver yields a CLP language with support for solver cooperation. Using the strategy definition framework of Meta-S we define classic...
متن کاملExtending the TOY System with the ECLiPSe Solver over Sets of Integers
Starting from a computational model for the cooperation of constraint domains in the CFLP context (with lazy evaluation and higher-order functions), we present the theoretical basis for the coordination domain C tailored to the cooperation of three pure domains: the domain of finite sets of integers (FS), the finite domain of integers (FD) and the Herbrand domain (H). We also present the adapta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002